Characterization of the Patterson graph
نویسندگان
چکیده
In this note we show that there is a unique distance-regular graph with intersection array {280, 243, 144, 10; 1, 8, 90, 280}.
منابع مشابه
A CHARACTERIZATION FOR METRIC TWO-DIMENSIONAL GRAPHS AND THEIR ENUMERATION
The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$. In this case, $B$ is called a textit{metric basis} for $G$. The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$. Givi...
متن کاملA New Method for Characterization of Biological Particles in Microscopic Videos: Hypothesis Testing Based on a Combination of Stochastic Modeling and Graph Theory
Introduction Studying motility of biological objects is an important parameter in many biomedical processes. Therefore, automated analyzing methods via microscopic videos are becoming an important step in recent researches. Materials and Methods In the proposed method of this article, a hypothesis testing function is defined to separate biological particles from artifact and noise in captured v...
متن کاملA Graphical Characterization for SPAP-Rings
Let $R$ be a commutative ring and $I$ an ideal of $R$. The zero-divisor graph of $R$ with respect to $I$, denoted by $Gamma_I(R)$, is the simple graph whose vertex set is ${x in Rsetminus I mid xy in I$, for some $y in Rsetminus I}$, with two distinct vertices $x$ and $y$ are adjacent if and only if $xy in I$. In this paper, we state a relation between zero-divisor graph of $R$ with respec...
متن کاملCharacterization of projective special linear groups in dimension three by their orders and degree patterns
The prime graph $Gamma(G)$ of a group $G$ is a graph with vertex set $pi(G)$, the set of primes dividing the order of $G$, and two distinct vertices $p$ and $q$ are adjacent by an edge written $psim q$ if there is an element in $G$ of order $pq$. Let $pi(G)={p_{1},p_{2},...,p_{k}}$. For $pinpi(G)$, set $deg(p):=|{q inpi(G)| psim q}|$, which is called the degree of $p$. We also set $D(G):...
متن کاملLine graphs associated to the maximal graph
Let $R$ be a commutative ring with identity. Let $G(R)$ denote the maximal graph associated to $R$, i.e., $G(R)$ is a graph with vertices as the elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $R$ containing both. Let $Gamma(R)$ denote the restriction of $G(R)$ to non-unit elements of $R$. In this paper we study the various graphi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004